#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    int a, b, c;
    cin >> a >> b >> c;
    int m;
    cin >> m;
    V<int> c1, c2;
    FOR(i, 1, m) {
        int x;
        string s;
        cin >> x >> s;
        if (s == "USB") {
            c1.eb(x);
        } else {
            c2.eb(x);
        }
    }

    sort(ALL(c1)), sort(ALL(c2));

    int ans = 0, cnt = 0;
    V<int> c3;

    FOR(i, 1, sz(c1)) {
        if (i <= a) {
            ans += c1[i - 1];
            cnt++;

        } else {
            c3.eb(c1[i - 1]);
        }
    }

    FOR(i, 1, sz(c2)) {
        if (i <= b) {
            ans += c2[i - 1];
            cnt++;

        } else {
            c3.eb(c2[i - 1]);
        }
    }

    sort(ALL(c3));

    FOR(i, 1, min(sz(c3), c)) {
        ans += c3[i - 1];
        cnt++;
    }

    cout << cnt << ' ' << ans << endl;
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    while (Task--) {
        solve();
    }

    return 0;
}